K voprosu o prisoedinenii Dagestana k Rossii (K 200-letiyu Gyulistanskogo dogovora)

نویسندگان

چکیده

برای دانلود باید عضویت طلایی داشته باشید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Studies of Three-Body B^+→D ̅^* 〖(2007)〗^0 K^+ K ̅^0 and B^0→D^* 〖(2010)〗^- K^+ K ̅^0 Decays

We analyze three-body decays of and . Under the factorization approach, there are tree level diagrams for these decay modes and the transition matrix element of decay is factorized into a form factor multiplied by decay constant and form factor multiplied into weak vertices form factor. The transition matrix element of decay is also factorized into a form factor multiplied into weak vertic...

متن کامل

An almost O(log k)-approximation for k-connected subgraphs

We consider two cases of the Survivable Network Design (SND) problem: given a complete graph Gn = (V,En) with costs on the edges and connectivity requirements {r(u, v) : u, v ∈ V }, find a minimum cost subgraph G of Gn that contains r(u, v) internally disjoint uv-paths for all u, v ∈ V . Our main result is an O (

متن کامل

Finding paths of length k in O*(2^k) time

The k-path problem is to determine if a given graph contains a simple path of length at least k, and if so, produce such a path. When k is given as a part of the input, the problem is wellknown to be NP-complete. The general problem has many practical applications (cf. [3, 15]). The trivial algorithm enumerating all possible k-paths in an n-node graph uses Θ(nk) time, so it is only polynomial f...

متن کامل

A Self-Stabilizing O(k)-Time k-Clustering Algorithm

A silent self-stabilizing asynchronous distributed algorithms is given for constructing a kdominating set, and hence a k-clustering, of a connected network of processes with unique IDs and no designated leader. The algorithm is comparison-based, takes O(k) time and uses O(k logn) space per process, where n is the size of the network. It is known that finding a minimal k-dominating set is NP-har...

متن کامل

The Threshold for Random k - SAT is 2 k log 2 − O ( k )

Let Fk(n, m) be a random k-CNF formula formed by selecting uniformly and independently m out of all possible k-clauses on n variables. It is well-known that if r ≥ 2 log 2, then Fk(n, rn) is unsatisfiable with probability that tends to 1 as n → ∞. We prove that if r ≤ 2 log 2 − tk, where tk = O(k), then Fk(n, rn) is satisfiable with probability that tends to 1 as n → ∞. Our technique, in fact, ...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: History, Archeology and Ethnography of the Caucasus

سال: 2012

ISSN: 2618-849X,2618-6772

DOI: 10.32653/ch833-7